Edge-Connectivity Augmentation Problems
نویسندگان
چکیده
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the augmentation problem. This problem has a wide variety [3-5, 10, 11, 14-201. If such a given condition is concerned with the vertexor edge-connectivity of a graph then the problem is referred to as the (vertexor edge-) connectivity augmentation problem. Frank and Chou [S] discussed the unweighted version of some edge-connectivity augmentation problem for graphs without edges, and showed that it is polynomially solvable. Eswaran and Tarjan [3] considered the following problems: (i) The strong connectivity augmentation problem for directed graphs. (ii) The bridge-connectivity augmentation probem for undirected graphs. (iii) The biconnectivity augmentation problem for undirected graphs.
منابع مشابه
Connectivity augmentation algorithms
The main subject of the thesis is connectivity augmentation: we would like to make a given graph k-connected by adding a minimum number of new edges. There are four basic problems in this field, since one might consider both edgeand node-connectivity augmentation in both graphs and digraphs. The thesis wishes to contribute to three out of these four problems: directedand undirected node-connect...
متن کاملA note on hypergraph connectivity augmentation
We prove an abstract version of an edge-splitting theorem for directed hypergraphs that appeared in [1], and use this result to obtain min-max theorems on hypergraph augmentation problems that are linked to orientations. These problems include (k, l)-edge-connectivity augmentation of directed hypergraphs, and (k, l)-partition-connectivity augmentation of undirected hypergraphs by uniform hypere...
متن کاملA Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
We consider connectivity-augmentation problems in a setting where each potential new edge has a nonnegative cost associated with it, and the task is to achieve a certain connectivity target with at most p new edges of minimum total cost. The main result is that the minimum cost augmentation of edge-connectivity from k − 1 to k with at most p new edges is fixed-parameter tractable parameterized ...
متن کاملNa-edge-connectivity Augmentation Problems by Adding Edges
The network reliability in multi-server environment is measured by the connectivity between a vertex and a vertex subset (NA-connectivity). The problem of augmenting a graph by adding the smallest number of new edges to meet NA-edge(vertex)-connectivity requirement is an important optimization problem that contributes to the network design problem to increase the reliability of a current networ...
متن کاملCombined Connectivity Augmentation and Orientation Problems
Two important branches of graph connectivity problems are connectivity augmentation, which consists of augmenting a graph by adding new edges so as to meet a specified target connectivity, and connectivity orientation, where the goal is to find an orientation of an undirected or mixed graph that satisfies some specified edge-connection property. In the present work an attempt is made to link th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 35 شماره
صفحات -
تاریخ انتشار 1987